package letcode.problem.dynamicProgra;

import java.util.Arrays;

/**
 * 最长等差数列
 * https://leetcode.cn/problems/longest-arithmetic-subsequence/description/?envType=study-plan-v2&envId=dynamic-programming
 * */
public class LongestArithmeticSubsequence {

    public static int longestArithSeqLength(int[] nums) {
//        int m = nums.length;
//        Arrays.sort(nums);
//        int[] dp = new int[m];
//        for (int i = 0; i < m; i++) {
//            dp[i] = 1;
//            for (int j = i + 1; j < i; j++) {
//                if (nums[i]-nums[j]){
//
//                }
//            }
//        }
        return -1;
    }
}
